An Expressive Extension of TLC

An Expressive Extension of TLC

A temporal logic of causality (TLC) was introduced by Alur, Penczek, and Peled in [1]. It is basically a linear time temporal logic interpreted over Mazurkiewicz traces which allows quantification over causal chains. Through this device one can directly formulate causality properties of distributed systems. In this paper we consider an extension of TLC by strengthening the chain quantification ...

OCLR: A More Expressive, Pattern-Based Temporal Extension of OCL

Modern enterprise information systems often require to specify their functional and non-functional (e.g., Quality of Service) requirements using expressions that contain temporal constraints. Specification approaches based on temporal logics demand a certain knowledge of mathematical logic, which is difficult to find among practitioners; moreover, tool support for temporal logics is limited. On...

An extension of the Wedderburn-Artin Theorem

‎In this paper we give conditions under which a ring is isomorphic to a structural matrix ring over a division ring.

An Operator Extension of Bohr's inequality

An Efficient Extension of Network Simplex Algorithm

In this paper, an efficient extension of network simplex algorithm is presented. In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by Network Simplex Algorithm (NSA) and NSA+, which extended the stand...